Artemis Time: A Mathematical Model to calculate Maximum acceptable waiting time in B2C E-commerce

نویسندگان

  • Ehsan Mousavi Khaneghah
  • Nosratollah Shadnoush
  • Amin Salem
چکیده

One of the main challenges in E-commerce is how to calculate the maximum acceptable time for response to the customer from the business firms. This case has a direct impact on many business concepts such as customer loyalty, satisfaction, and trust. In this paper, a mathematical model is presented to calculate the maximum acceptable time. In this regard, based on a set of functions, while investigating factors affecting the business from customer's perspective. This mathematical model has the ability to use in any kind of B2C-based e-commerce system due to the consideration of the partial elongation set between elements that affect time transparency. The business using this function and managing the elements that affect this function is able to manage its operations in a way that conducts business activities in accordance with client time estimates. This will increase satisfaction and customer’ trust in the business.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Trust Model for B2C E-Commerce Based on 3D User Interfaces

Lack of trust is one of the key bottle necks in e-commerce development. Nowadays many advanced technologies are trying to address the trust issues in e-commerce. One among them suggests using suitable user interfaces. This paper investigates the functionality and capabilities of 3D graphical user interfaces in regard to trust building in the customers of next generation of B2C e-commerce websit...

متن کامل

Implementation of Job Scheduling Algorithms in a Cloud Computing Environment for B2C Electronic Commerce architecture using GI/G/1 queuing model

Traditional B2C Electronic Commerce architecture instigated using n-Tier Client/Server architecture has continually been sluggish, intricate, and costly. With the advent of Cloud computing environment, the amenities vital for the Electronic Commerce architecture are accomplished by proficient organization, which comprises servers, storage supervision, network skills, and virtualization technolo...

متن کامل

Cognitive Parameter Based Agent Selection and Negotiation Process for B2C E-Commerce

Multi-agent paradigms have been developed for the negotiation and brokering in B2C e-commerce. Few of the models consider the mental states and social settings (trust and reputation) but rarely any model depicts their combination. In this chapter, a combined model of belief, desire, intention (BDI) for agent’s mental attitudes and social settings is used to model their cognitive capabilities. T...

متن کامل

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

Dynamical Trust and Reputation Computation Model for B2C E-Commerce

Trust is one of the most important factors that influence the successful application of network service environments, such as e-commerce, wireless sensor networks, and online social networks. Computation models associated with trust and reputation have been paid special attention in both computer societies and service science in recent years. In this paper, a dynamical computation model of repu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017